Concerning the semantic consequence relation in first-order temporal logic

Policy Monitoring in First-Order Temporal Logic

We present an approach to monitoring system policies. As a specification language, we use an expressive fragment of a temporal logic, which can be effectively monitored. We report on case studies in security and compliance monitoring and use these to show the adequacy of our specification language for naturally expressing complex, realistic policies and the practical feasibility of monitoring t...

First-Order Queries over Temporal Databases Inexpressible in Temporal Logic

Queries over temporal databases involve references to time. We study diierences between two approaches of including such references into a rst-order query language (e.g., relational calculus): explicit (using typed variables and quantiiers) vs. implicit (using a nite set of modal connectives). We also show that though the latter approach|a rst-order query language with implicit references to ti...

Proof Planning for First-Order Temporal Logic

Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal Logic (FOLTL), which can be seen as a quantified version of Linear Temporal Logic, overcoming its finitary limitation. Automated reasoning in FOLTL is hard, since it is non-recursively enumerable; but its expressivenes...

Equality and Monodic First-Order Temporal Logic

It has been shown recently that monodic first-order temporal logic without functional symbols but with equality is incomplete, i.e. the set of the valid formulae of this logic is not recursively enumerable. In this paper we show that an even simpler fragment consisting of monodic monadic two-variable formulae is not recursively enumerable.

On First Order Interval Temporal Logic